On approximate quasi Pareto solutions in nonsmooth semi-infinite interval-valued vector optimization problems

نویسندگان

چکیده

This paper deals with approximate solutions of a nonsmooth semi-infinite programming multiple interval-valued objective functions. We first introduce four types quasi Pareto the considered problem by considering lower-upper interval order relation and then apply some advanced tools variational analysis generalized differentiation to establish necessary optimality conditions for these solutions. Sufficient such are also provided means introducing concepts (strictly) pseudo-quasi convex functions defined in terms limiting subdifferential locally Lipschitz Finally, Mond–Weir type dual model form is formulated, weak, strong converse-like duality relations proposed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimality conditions for Pareto efficiency and proper ideal point in set-valued nonsmooth vector optimization using contingent cone

In this paper, we first present a new important property for Bouligand tangent cone (contingent cone) of a star-shaped set. We then establish optimality conditions for Pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of Bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.

متن کامل

Quasi-Gap and Gap Functions for Non-Smooth Multi-Objective Semi-Infinite Optimization Problems

In this paper‎, ‎we introduce and study some new single-valued gap functions for non-differentiable semi-infinite multiobjective optimization problems with locally Lipschitz data‎. ‎Since one of the fundamental properties of gap function for optimization problems is its abilities in characterizing the solutions of the problem in question‎, ‎then the essential properties of the newly introduced ...

متن کامل

Existence of Solutions for Nonconvex and Nonsmooth Vector Optimization Problems

We consider the weakly efficient solution for a class of nonconvex and nonsmooth vector optimization problems in Banach spaces. We show the equivalence between the nonconvex and nonsmooth vector optimization problem and the vector variational-like inequality involving set-valued mappings. We prove some existence results concerned with the weakly efficient solution for the nonconvex and nonsmoot...

متن کامل

On Weak Pareto Optimality for Pseudoconvex Nonsmooth Multiobjective Optimization Problems

The purpose of this paper is to characterize the weak Pareto optimality for multiobjective pseudoconvex problem. In fact, it is a first order optimality characterization that generalize the Karush-Kuhn-Tucker condition. Moreover, this work is an extension of the single-objective case [6] to the multiobjective one with pseudoconvex continuous functions. Mathematics Subject Classification: 46N10,...

متن کامل

Optimality conditions for approximate solutions of vector optimization problems with variable ordering structures

‎We consider nonconvex vector optimization problems with variable ordering structures in Banach spaces‎. ‎Under certain boundedness and continuity properties we present necessary conditions for approximate solutions of these problems‎. ‎Using a generic approach to subdifferentials we derive necessary conditions for approximate minimizers and approximately minimal solutions of vector optimizatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applicable Analysis

سال: 2022

ISSN: ['1026-7360', '1563-504X', '0003-6811']

DOI: https://doi.org/10.1080/00036811.2022.2027385